TRB exam online practice test for Computer Science and Engineering dept provides you with ample practice material for TRB exam preparation for cse department which adheres to the real exam format. Each TRB - CSE exam practice test has 10 questions. After completing click on to the COMPLETE TEST to know the score and the correct answers.


Computer Science and Engineering - TRB Online Practice Test - 9

  • Online Practice Test - CSE
   

1.
  A computer system has 6 tape drivers, with ′n′ processes competing for them. Each process may need 3 tape drives. The maximum value of ′n′ for which is system is guaranteed to be deadlock tree is:.
  • A.   4
  •  
  • B.   3
  •  
  • C.   2
  •  
  • D.   1
  Options: A    B    C    D   
   
 
   

2.
  Consider a logical address space of 8 pages of 1024 words mapped into memory of 32 frames. The number in bits n the logical address and physical address are:.
  • A.   13 and 15 bits respectively
  •  
  • B.   15 and 13 bits respectively
  •  
  • C.   11 and 13 bits respectively
  •  
  • D.   13 and 13 bits respectively
  Options: A    B    C    D   
   
   

3.
  The area of the region between the curve y = 4-x2 , 0≤x &Ge;3 and the x-axis is:.
  • A.   3
  •  
  • B.   16/3
  •  
  • C.   23/3
  •  
  • D.   7/3
  Options: A    B    C    D   
   
 
   

4.
  On a system using demand-paged memory, it takes 250 ns to satisfy a memory request if the page is in memory. If the page is not in memory, the request takes 5 ms if a free frame is available or 12 ms if the page to be swapped out has been modified. What is the effective access time if the page fault rate is 2% and 40% of the time the page to be replaced has been modified? .
  • A.   300.19 µs
  •  
  • B.   196 µs
  •  
  • C.   156.25 µs
  •  
  • D.   249.8 µs
  Options: A    B    C    D   
   
   

5.
  Match the following :
(a) Projection - (i) Yield a horizontal subset of a relation
(b) Selection - (ii) Select a vertical subset of a relation
(C) Join - (iii) Allow combining two relations
Codes
(a) (b) (c) .
  • A.   (ii) (i) (iii)
  •  
  • B.   (iii) (ii) (i)
  •  
  • C.   (i) (iii) (ii)
  •  
  • D.   (i) (ii) (iii)
  Options: A    B    C    D   
   
 
   

6.
  An ordered file with 30000 records stored on a disk with block size B =1024 bytes. File records are of fixed size and unspanned with record length R=99 bytes with an addition one byte deletion marker. The blocking factor and the number of bocks needed for the file would be:.
  • A.   10 and 300
  •  
  • B.   10 and 3000
  •  
  • C.   11 and 2727
  •  
  • D.   30 and 11
  Options: A    B    C    D   
   
   

7.
  The prefix of ( A + B ) * ( C - D)/ E * F is :.
  • A.   / + AB * CD
  •  
  • B.   / * + ABCD * EF
  •  
  • C.   */* + AB - CDEF
  •  
  • D.   ** AB + CD/EF
  Options: A    B    C    D   
   
 
   

8.
  A binary search tree is generated by inserting the following integers in order 50,15,62,5,20,58,91,3,8,37,60,24
The number of nodes in the left sub tree and right sub tree of root respectively is : .
  • A.   (4,7)
  •  
  • B.   (7,4)
  •  
  • C.   (8,3)
  •  
  • D.   (3,8)
  Options: A    B    C    D   
   
   

9.
  The minimum number of interchanges needed to convert the array 89,19,40,17,12,10,2,5,7,11,6,9,70 into a heap with the maximum element at the root is:.
  • A.   0
  •  
  • B.   1
  •  
  • C.   2
  •  
  • D.   3
  Options: A    B    C    D   
   
 
   

10.
  Consider the following code segment
for (i = 0; i < N; i++) {
for (j = 0; j < N; j++) {
if (C%2)
{
X+ =(4*j+5*i);
Y+ =(7 + 4*j);
}}}
Which one of the following is false? .
  • A.   code contains loop invariant computation
  •  
  • B.   There is a scope of common subexpression elimination
  •  
  • C.   There is a scope of strength reduction in code
  •  
  • D.   There is a scope for deadcode elimination
  Options: A    B    C    D   
   

Complete Test
tnscholars.com

 

 

 

tnscholars.com.